Diffusion Controlled Cellular Automaton Performing Mesh Partitioning
نویسنده
چکیده
A model performing mesh partitioning into computationally equivalent mesh parts on regular square lattices using a diffusion controlled cellular automaton (DCCA) is proposed and studied in this article. Every processor has assigned a domain seed at the beginning of a simulation. Algorithm works with growth of seeds and migration of domain borders, the later is triggered when the difference of diffusive agents on both sides of a border exceeds a given threshold. The model is built using self-organization principles ensuring convergence. Solutions are dynamically stable configurations achieved from any initial configuration.
منابع مشابه
Partitioning of Regular Computation on Multiprocessor Systems
Problem partitioning of regular computation over two-dimensional meshes on multiprocessor systems is examined. The regular computation model considered involves repetitive evaluation of values at each mesh point with local communication. The computational workload and the communication pattern are the same at each mesh point. The regular computation model arises in numerical solutions of partia...
متن کاملMesoscopic-microscopic spatial stochastic simulation with automatic system partitioning.
The reaction-diffusion master equation (RDME) is a model that allows for efficient on-lattice simulation of spatially resolved stochastic chemical kinetics. Compared to off-lattice hard-sphere simulations with Brownian dynamics or Green's function reaction dynamics, the RDME can be orders of magnitude faster if the lattice spacing can be chosen coarse enough. However, strongly diffusion-control...
متن کاملA cellular automaton technique for modelling of a binary dendritic growth with convection
A two-dimensional model for the simulation of a binary dendritic growth with convection has been developed in order to investigate the effects of convection on dendritic morphologies. The model is based on a cellular automaton (CA) technique for the calculation of the evolution of solid/liquid (s/l) interface. The dynamics of the interface controlled by temperature, solute diffusion and Gibbs–T...
متن کاملReversible Cellular Automaton Able to Simulate Any Other Reversible One Using Partitioning Automata
Partitioning automata (PA) are de ned. They are equivalent to cellular automata (CA). Reversible sub-classes are also equivalent. A simple, reversible and universal partitioning automaton is described. Finally, it is shown that there are reversible PA and CA that are able to simulate any reversible PA or CA on any con guration.
متن کاملA Cellular Automaton Based Algorithm for Mobile Sensor Gathering
In this paper we proposed a Cellular Automaton based local algorithm to solve the autonomously sensor gathering problem in Mobile Wireless Sensor Networks (MWSN). In this problem initially the connected mobile sensors deployed in the network and goal is gather all sensors into one location. The sensors decide to move only based on their local information. Cellular Automaton (CA) as dynamical sy...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004